Explanation-based Generalization in a Logic-Programming Environment

نویسنده

  • Haym Hirsh
چکیده

This paper describes a domain-independent implemen­ tation of explanation-based generalization (EBG) within a logic-programming environment. Explanation is inter­ leaved with generalization, so that as the training instance is proven to be a positive example of the goal concept, the generalization is simultaneously created. All aspects of the EBG task are viewed in logic, which provides a clear semantics for EBG, and allows its integration into the logic-programming system. In this light operationally becomes a property requiring explicit reasoning. Addition­ ally, viewing EBG in logic clarifies the relation of learning search-control to EBG, and suggests solutions for dealing with imperfect domain theories.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Explanation-Based Learning in Logic Programming

It has been argued in the literature that logic programming provides a uniform, expressive, and semantically clean framework for all aspects explanation-based generalization. Previous treatments, however, are inadequate in that they do not work well in difficult problem domains such as theorem proving or formal program development, primarily because meta-programs for such tasks in traditional l...

متن کامل

An Extension of Explanation-Based Generalization to Negation as Failure

Implementations of Explanation-Based Generalization (EBG) within a logic-programming environment, as e.g. the well-known PROLOG-EBG algorithm KCMcC87], are able to generalize the proof of a goal from a deenite (i.e. Horn clause) domain theory. However, it is a fact that practical applications frequently require the enhanced ex-pressiveness of negations in rule bodies. Speciically, this is the c...

متن کامل

Extending EBG to Term-Rewriting Systems

We show that the familiar explanation-based generalization (EBG) procedure is applicable to a large family of programming languages, including three families of importance to AI: logic programming (such as Prolog); lambda calculus (such as LISP); and combinator languages (such as FP). The main application of this result is to extend the algorithm to domains for which predicate calculus is a poo...

متن کامل

Factors Influencing Categorization Strategy in Visual Category Learning

Studies in visual category learning show that participants use different category generalization strategies. Some studies report a preference for a rule-based strategy, while others report a preference for a similarity-based strategy. We conducted category learning experiments in which we varied three variables — family resemblance of a category, saliency of the defining rule and presentation o...

متن کامل

Formalizing a Spectrum of Plan Generalizations Based on Modal Truth Criteria

Plan generalizations are of considerable importance in improving planning performance through reuse. In this paper, we provide a unified framework for analytic (non-inductive) plan generalization based on explanation of plan correctness with respect to modal truth criteria. Within this framework, we explore a large spectrum of generalizations based on the type of constraints on the plan that ar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1987